Geometric and harmonic means based priority dispatching rules for single machine scheduling problems

[EN] This work proposes two new prority dispatching rules (PDRs) for solving single machine scheduling problems. These rules are based on the geometric mean (GM) and harmonic mean (HM) of the processing time (PT) and the due date (DD) and they are referred to as GMPD and HMPD respectively. Performance of the proposed PDRs is evaluated on the basis of five measures/criteria i.e. Total Flow Time (TFT), Total Lateness (TL), Number of Late Jobs (TNL), Total Earliness (TE) and Number of Early Parts (TNE). It is found that GMPD performs better than other PDRs in achieving optimal values of multiple performance measures. Further, effect of variation in the weight assigned to PT and DD on the combined performance of TFT and TL is also examined which reveals that for deriving optimal values of TFT and TL, weighted harmonic mean (WHMPD) rule with a weight of 0.105 outperforms other PDRs. The weighted geometric mean (WGMPD) rule with a weight of 0.37 is found to be the next after WHMPD followed by the weighted PDT i.e. WPDT rule with a weight of 0.76.Ahmad, S.; Khan, ZA.; Ali, M.; Asjad, M. (2021). Geometric and harmonic means based priority dispatching rules for single machine scheduling problems. International Journal of Production Management and Engineering. 9(2):93-102. https://doi.org/10.4995/ijpme.2021.15217OJS9310292Baharom, M. Z., Nazdah, W., &Hussin, W. (2015). Scheduling Analysis for Job Sequencing in Veneer Lamination Line. Journal of Industrial and Intelligent Information, 3(3). https://doi.org/10.12720/jiii.3.3.181-185Chan, F. T. S., Chan, H. K., Lau, H. C. W., & Ip, R. W. L. (2003). Analysis of dynamic dispatching rules for a flexible manufacturing system. Journal of Materials Processing Technology, 138(1), 325-331. https://doi.org/10.1016/S0924-0136(03)00093-1Cheng, T. C. E., &Kahlbacher, H. G. (1993). Single-machine scheduling to minimize earliness and number of tardy jobs. Journal of Optimization Theory and Applications, 77(3), 563-573. https://doi.org/10.1007/BF00940450da Silva, N. C. O., Scarpin, C. T., Pécora, J. E., & Ruiz, A. (2019). Online single machine scheduling with setup times depending on the jobs sequence. Computers & Industrial Engineering, 129, 251-258. https://doi.org/10.1016/j.cie.2019.01.038Doh, H.H., Yu, J.M., Kim, J.S., Lee, D.H., & Nam, S.H. (2013). A priority scheduling approach for flexible job shops with multiple process plans. International Journal of Production Research, 51(12), 3748-3764. https://doi.org/10.1080/00207543.2013.765074Dominic, Panneer D. D., Kaliyamoorthy, S., & Kumar, M. S. (2004). Efficient dispatching rules for dynamic job shop scheduling. The International Journal of Advanced Manufacturing Technology, 24(1), 70-75.Ðurasević, M., &Jakobović, D. (2018). A survey of dispatching rules for the dynamic unrelated machines environment. Expert Systems with Applications, 113, 555-569. https://doi.org/10.1016/j.eswa.2018.06.053Forrester, P. (2006). Operations Management: An Integrated Approach. International Journal of Operations & Production Management.Geiger, C. D., &Uzsoy, R. (2008). Learning effective dispatching rules for batch processor scheduling. International Journal of Production Research, 46(6), 1431-1454. https://doi.org/10.1080/00207540600993360Hamidi, M. (2016). Two new sequencing rules for the non-preemptive single machine scheduling problem. The Journal of Business Inquiry, 15(2), 116-127.Holthaus, O., & Rajendran, C. (1997). New dispatching rules for scheduling in a job shop-An experimental study. The International Journal of Advanced Manufacturing Technology, 13(2), 148-153. https://doi.org/10.1007/BF01225761Hussain, M. S., & Ali, M. (2019). A Multi-agent Based Dynamic Scheduling of Flexible Manufacturing Systems. Global Journal of Flexible Systems Management, 20(3), 267-290. https://doi.org/10.1007/s40171-019-00214-9Jayamohan, M. S., & Rajendran, C. (2000). New dispatching rules for shop scheduling: A step forward. International Journal of Production Research, 38(3), 563-586. https://doi.org/10.1080/002075400189301Kadipasaoglu, S. N., Xiang, W., &Khumawala, B. M. (1997). A comparison of sequencing rules in static and dynamic hybrid flow systems. International Journal of Production Research, 35(5), 1359-1384. https://doi.org/10.1080/002075497195371Kanet, J. J., & Li, X. (2004). A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness. Journal of Scheduling, 7(4), 261-276. https://doi.org/10.1023/B:JOSH.0000031421.64487.95Lee, D.K., Shin, J.H., & Lee, D.H. (2020). Operations scheduling for an advanced flexible manufacturing system with multi-fixturing pallets. Computers & Industrial Engineering, 144, 106496. https://doi.org/10.1016/j.cie.2020.106496Lu, C.C., Lin, S.W., & Ying, K.C. (2012). Robust scheduling on a single machine to minimize total flow time. Computers & Operations Research, 39(7), 1682-1691. https://doi.org/10.1016/j.cor.2011.10.003Krishnan, M., Chinnusamy, T. R., & Karthikeyan, T. (2012). Performance Study of Flexible Manufacturing System Scheduling Using Dispatching Rules in Dynamic Environment. Procedia Engineering, 38, 2793-2798. https://doi.org/10.1016/j.proeng.2012.06.327Munir, E. U., Li, J., Shi, S., Zou, Z., & Yang, D. (2008). MaxStd: A task scheduling heuristic for heterogeneous computing environment. Information Technology Journal, 7(4), 679-683. https://doi.org/10.3923/itj.2008.679.683Oyetunji, E. O. (2009). Some common performance measures in scheduling problems. Research Journal of Applied Sciences, Engineering and Technology, 1(2), 6-9.Pinedo, M. L. (2009). Planning and Scheduling in Manufacturing and Services (2nd ed.). Springer-Verlag. https://doi.org/10.1007/978-1-4419-0910-7Prakash, A., Chan, F. T. S., & Deshmukh, S. G. (2011). FMS scheduling with knowledge based genetic algorithm approach. Expert Systems with Applications, 38(4), 3161-3171. https://doi.org/10.1016/j.eswa.2010.09.002Rafsanjani, M. K., &Bardsiri, A. K. (2012). A New Heuristic Approach for Scheduling Independent Tasks on Heterogeneous Computing Systems. International Journal of Machine Learning and Computing, 371-376. https://doi.org/10.7763/IJMLC.2012.V2.147Tyagi, N., Tripathi, R. P., &Chandramouli, A. B. (2016). Single Machine Scheduling Model with Total Tardiness Problem. Indian Journal of Science and Technology, 9(37). https://doi.org/10.17485/ijst/2016/v9i37/97527Vinod, V., & Sridharan, R. (2008). Dynamic job-shop scheduling with sequence-dependent setup times: Simulation modeling and analysis. The International Journal of Advanced Manufacturing Technology, 36(3), 355-372. https://doi.org/10.1007/s00170-006-0836-4Waikar, A. M., Sarker, B. R., & Lal, A. M. (1995). A comparative study of some priority dispatching rules under different shop loads. Production Planning & Control, 6(4), 301-310. https://doi.org/10.1080/0953728950893028

Pretenuring for Java

Pretenuring is a technique for reducing copying costs in garbage collectors. When pretenuring, the allocator places long-lived objects into regions that the garbage collector will rarely, if ever, collect. We extend previous work on profiling-driven pretenuring as follows. (1) We develop a collector-neutral approach to obtaining object lifetime profile information. We show that our collection of Java programs exhibits a very high degree of homogeneity of object lifetimes at each allocation site. This result is robust with respect to different inputs, and is similar to previous work on ML, but is in contrast to C programs, which require dynamic call chain context information to extract homogeneous lifetimes. Call-site homogeneity considerably simplifies the implementation of pretenuring and makes it more efficient. (2) Our pretenuring advice is neutral with respect to the collector algorithm, and we use it to improve two quite different garbage collectors: a traditional generational collector and an older-first collector. The system is also novel because it classifies and allocates objects into 3 categories: we allocate immortal objects into a permanent region that the collector will never consider, long-lived objects into a region in which the collector placed survivors of the most recent collection, and shortlived objects into the nursery, i.e., the default region. (3) We evaluate pretenuring on Java programs. Our simulation results show that pretenuring significantly reduces collector copying for generational and older-first collectors. 1

Noninvasive Diagnosis of Visceral Leishmaniasis:Development and Evaluation of Two Urine-Based Immunoassays for Detection of Leishmania donovani Infection in India

Visceral leishmaniasis (VL), one of the most prevalent parasitic diseasesin the developing world causes serious health concerns. Post kala-azar dermal leishmaniasis (PKDL) is a skin disease which occurs after treatment as a sequel to VL. Parasitological diagnosis involves invasive tissue aspiration which is tedious and painful. Commercially available immunochromatographic rapid diagnostic test such as rK39-RDT is used for field diagnosis of VL, detects antibodiesin serum samples. Urine sample is however, much easier in collection,storage and handling than serum and would be a better alternative where collection of tissue aspirate or blood is impractical. In this study, we have developed and evaluated the performance of two urine-based diagnostic assays, ELISA and dipstick test, and compared the results with serologicalrK39-RDT. Our study shows the capability of urinebased tests in detecting anti-Leishmania antibodies effectively for both VL and PKDL diagnosis. The ability of dipstick test to demonstrate negative results after six months in 90% of the VL cases after treatment could be useful as a test of clinical cure. Urine-based tests can therefore replace the need for invasive practices and ensure better diagnosi

Diagenetic characteristics and their implications on the reservoir potential of Bajocian Sandstone, Jaisalmer Basin, western Rajasthan, India

Petrography and scanning electron microscopy (SEM) investigations aided by energy dispersive X-ray (EDX) analysis and quantitative measurement of reservoir properties were used to extensively examine the physical and diagenetic characteristics of the Joyan Member Sandstone of Jaisalmer Formation. The Joyan Member Sandstone is fine- to medium-grained, moderate to well sorted, sublitharenite to litharenite. Mechanical compaction, precipitation of calcareous, ferruginous and silica cements, clay minerals, dissolution and alteration of unstable clastic grains such as feldspar and rock fragments, and grain fracturing are the identified diagenetic features. Feldspar and rock fragments underwent significant changes to kaolinite and chlorite while silica cement primarily originated from the dissolution and alteration of these grains and pressure solution. Mechanical compaction and the authigenic cements like calcareous, ferruginous, and silica reduced primary porosity, while secondary porosity was created by dissolution of clastic grains and cements. Compaction reduced porosity from an anticipated original 40% to around 13.4%. Porosity was reduced by cementation to 20.8%. Cementation reduced the porosity of the Joyan Member Sandstone somewhat more than compaction. Calcareous cementation played a major role in the porosity evolution of Joyan Member Sandstone. During early burial, the early calcareous cement occupied most of the pore spaces, leading to a significant reduction in porosity. However, incomplete filling or scattered patches of calcareous cement helped to preserve some primary porosity. In addition to calcareous cement, clay minerals like kaolinite and chlorite also acted as pore-filling and pore-lining cements. Kaolinite had a booklet-like or lamellar pattern contributing to minor porosity loss through pore-occlusion, while pore lining chlorite helped to retain porosity by preventing syntaxial silica overgrowth. Extensive dissolution of calcareous cement significantly increased the secondary porosity. Diagenesis affects reservoir quality by reducing initial porosity through cementation and compaction, and then increasing it through dissolution of early calcareous cement and unstable grains. The diagenesis of the studied sandstone is closely linked to its potential as a reservoir

The non-Newtonian maxwell nanofluid flow between two parallel rotating disks under the effects of magnetic field

Abstract The main feature of the present numerical model is to explore the behavior of Maxwell nanoliquid moving within two horizontal rotating disks. The disks are stretchable and subjected to a magnetic field in axial direction. The time dependent characteristics of thermal conductivity have been considered to scrutinize the heat transfer phenomena. The thermophoresis and Brownian motion features of nanoliquid are studied with Buongiorno model. The lower and upper disk's rotation for both the cases, same direction as well as opposite direction of rotation is investigated. The subsequent arrangement of the three dimensional Navier Stoke’s equations along with energy, mass and Maxwell equations are diminished to a dimensionless system of equations through the Von Karman’s similarity framework. The comparative numerical arrangement of modeled equations is further set up by built-in numerical scheme “boundary value solver” (Bvp4c) and Runge Kutta fourth order method (RK4). The various physical constraints, such as Prandtl number, thermal conductivity, magnetic field, thermal radiation, time relaxation, Brownian motion and thermophoresis parameters and their impact are presented and discussed briefly for velocity, temperature, concentration and magnetic strength profiles. In the present analysis, some vital characteristics such as Nusselt and Sherwood numbers are considered for physical and numerical investigation. The outcomes concluded that the disk stretching action opposing the flow behavior. With the increases of magnetic field parameter $$M$$ M the fluid velocity decreases, while improving its temperature. We show a good agreement of the present work by comparing with those published in literature